Finding the critical path in a time-constrained workflow

نویسندگان

  • Jin Hyun Son
  • Myoung-Ho Kim
چکیده

The concept of the critical path has not been much addressed in a workflow even though it has been studied in many areas of computer engineering such as a directed acyclic graph. In this paper we first specify workflow control constructs which create workflow control structures used to describe business processes. And, we propose a method to find out the critical path in a time-constrained workflow built by the workflow control constructs defined in the paper. Because the concept of the critical path may be fundamental and useful in the context of a workflow, it can be effectively utilized in many workflow issues such as workflow resource management and workflow time management.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Resource Reliability Support for Grid Workflows

Grid workflow can be defined as an organization of Grid Services into a well-defined flow of operations, and can be thought of as the composition of Grid Services over time on heterogeneous and distributed resources in a well-defined order to accomplish a specific goal. To the time-constrained workflow Scheduling in Grids, we present a scheduling algorithm in terms of the finite-state continuou...

متن کامل

Budget Constrained Scheduling of Grid Workflows Using Partial Critical Paths

Workflow scheduling on utility Grids is a complex multi-objective optimization problem which tries to optimize several scheduling criteria such as execution time and cost. One common approach to the problem is to optimize only one criterion, while other criteria are constrained within fixed thresholds. In this paper, we propose a new scheduling algorithm called Budget Partial Critical Path (Bud...

متن کامل

Workflow Timed Critical Path Optimization

Approaches to shorten workflow execution time have been discussed in many area of computer engineering such as parallel and distributed systems, a computer circuit, and PERT chart for project management. To optimize workflow model structure of workflow, an approach with corresponding algorithms is proposed to cut timed critical path of workflow schema, which has the longest average execution ti...

متن کامل

An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...

متن کامل

An Efficient Method for Selecting a Reliable Path under Uncertainty Conditions

In a network that has the potential to block some paths, choosing a reliable path, so that its survival probability is high, is an important and practical issue. The importance of this issue is very considerable in critical situations such as natural disasters, floods and earthquakes. In the case of the reliable path, survival or blocking of each arc on a network in critical situations is an un...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000